The Bit-Search Generator
نویسندگان
چکیده
We present the construction of a pseudorandom generator, that we call the Bit-Search Generator (BSG), based on a single input sequence. The construction is related to the so-called Self-Shrinking Generator which is known for its simplicity (conception and implementation-wise) linked with some interesting properties. After presenting the general running, we give a description of the BSG by using permutations and we study some properties of it. We also give statistical results.
منابع مشابه
Some observations on the Bit-Search Generator
In this short note an alternative definition of the Bit-Search Generator (BSG) is provided. This leads to a discussion of both the security of the BSG and ways in which it might be modified to either improve its rate or increase its security.
متن کاملGeneric parity generators design using LTEx methodology: A quantum-dot cellular automata based approach
Quantum-dot Cellular Automata (QCA) is a prominent paradigm that is considered to continue its dominance in thecomputation at deep sub-micron regime in nanotechnology. The QCA realizations of five-input Majority Voter based multilevel parity generator circuits have been introduced in recent years. However, no attention has been paid towards the QCA instantiation of the generic (n-bit) even and ...
متن کاملGeneric parity generators design using LTEx methodology: A quantum-dot cellular automata based approach
Quantum-dot Cellular Automata (QCA) is a prominent paradigm that is considered to continue its dominance in thecomputation at deep sub-micron regime in nanotechnology. The QCA realizations of five-input Majority Voter based multilevel parity generator circuits have been introduced in recent years. However, no attention has been paid towards the QCA instantiation of the generic (n-bit) even and ...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کامل